Dynamic programming on a functional memory computer

Running dynamic programming algorithms on a DNA computer

In this paper we show that DNA computers are especially useful for running algorithms which are based on dynamic programming. This class of algorithms takes advantage of the large memory capacity of a DNA computer. We present algorithms for solving the knapsack problem and argue that a DNA computer can solve much larger instances of this problem than a conventional computer. Unlike other algori...

Dynamic Storage Allocation on a Computer with Virtual Memory

We compare several dynamic storage strategies under the assumption that they will be used on a computer with virtual memory. On such a computer the total (virtual) memory referenced by a process may exceed the actual amount of random-access memory available to the process, and it is usually more important to minimize the number of page faults than the virtual memory required by the process. We ...

Functional Programming with Dynamic Binding

Dynamic binding is a runtime operation which looks up some names in some environments: examples are quote and eval in LISP or object-oriented message passing. We present a functional language, in the spirit of ML or Haskell, which supports dynamic binding. At the surface level, the language supports constructs such as extensible records, variants, extensible case selection, quoted terms, and ca...

Functional Approximations and Dynamic Programming

Dynamic programming for computer register allocation

Scope and pur~s~computers and operations research admit to a rich and complex interface. Most examples of problem solving in this domain use both computers and operations research as tools to solve problems[I. 21. In particular, the computer is used as a tool in implementing a solution technique arising from an operations research model. A different aspect of this interface is explored here: op...